Proof planning with multiple strategies

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof planning with multiple strategies

Humans have diierent problem solving strategies at their disposal and they can exibly employ several strategies when solving a complex problem, whereas previous theorem proving and planning systems typically employ a single strategy or a hard coded combination of a few strategies. We introduce multi-strategy proof planning that allows for combining a number of strategies and for switching exibl...

متن کامل

Proof Planning with Multiple Strategies II

Humans have diierent problem solving strategies at their disposal and they can exibly employ several strategies when solving a complex problem, whereas previous planning or theorem proving systems employ a single strategy or a xed combination of a few strategies. We extend the notion of strategies in a way that can additionally help to structure the vast amount of knowledge in mathematics. We p...

متن کامل

Proof Planning with Multiple

Humans have diierent problem solving strategies at their disposal and they can exibly employ several strategies when solving a complex problem, whereas previous planning and theorem proving systems typically employ a single strategy or a hard coded combination of a few strategies. We introduce multi-strategy proof planning that allows to combine a number of strategies and to switch between them...

متن کامل

Assertion level proof planning with compiled strategies

The objective of this thesis is to ease the formalization of proofs by being able to verify as well as to automatically construct abstract human-style proofs. This is achieved by lifting the logical basis to the abstract assertion level, which has been identified as a style of reasoning that can be found in textbooks. A case study shows that automatic reasoning procedures benefit from the abstr...

متن کامل

Parallel Path Planning with Multiple Evasion Strategies

Probabilistic path planning driven by a potential field is a well established technique and has been successfully exploited to solve complex problems arising in a variety of domains. However, planners implementing this approach are rather inefficient in dealing with certain types of local minima occurring in the potential field, especially those characterized by deep or large attraction basins....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2008

ISSN: 0004-3702

DOI: 10.1016/j.artint.2007.11.004